Abstract Representations and Frequent Pattern Discovery
نویسنده
چکیده
We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be cast into the powerful language of algorithmic information theory. This allows us to formulate a simple algorithm to mine for all frequent patterns. 1
منابع مشابه
Automata Theory Approach for Solving Frequent Pattern Discovery Problems
The various types of frequent pattern discovery problem, namely, the frequent itemset, sequence and graph mining problems are solved in different ways which are, however, in certain aspects similar. The main approach of discovering such patterns can be classified into two main classes, namely, in the class of the levelwise methods and in that of the database projection-based methods. The level-...
متن کاملA Logic Approach to Mine Syntactic Fragments of Mesh Keywords in Biomedical Literature
The discovery of new and potentially meaningful dependencies between biomedical keywords in literature can take great advantage from the application of a logic approach to text mining. This is motivated by the peculiarity of logic approaches to be able to express and manipulate relations between objects. We investigate the application of a logic approach to the task of frequent pattern discover...
متن کاملSymCHM—An Unsupervised Approach for Pattern Discovery in Symbolic Music with a Compositional Hierarchical Model
This paper presents a compositional hierarchical model for pattern discovery in symbolic music. The model can be regarded as a deep architecture with a transparent structure. It can learn a set of repeated patterns within individual works or larger corpora in an unsupervised manner, relying on statistics of pattern occurrences, and robustly infer the learned patterns in new, unknown works. A le...
متن کاملApproximate Frequent Pattern Discovery Over Data Stream
Frequent pattern discovery over data stream is a hard problem because a continuously generated nature of stream does not allow a revisit on each data element. Furthermore, pattern discovery process must be fast to produce timely results. Based on these requirements, we propose an approximate approach to tackle the problem of discovering frequent patterns over continuous stream. Our approximatio...
متن کاملPattern Discovery in Temporal Databases: A Temporal Logic Approach
1 This work was supported in part by the NSF under grant IRI-93-18773. Abstract The work of Mannila et al. [4] of finding frequent episodes in sequences is extended to finding temporal logic patterns in temporal databases. It is argued that temporal logic provides an appropriate formalism for expressing temporal patterns defined over categorical data. It is also proposed to use Temporal Logic P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1202.2167 شماره
صفحات -
تاریخ انتشار 2012